Constraint-Directed Search: A Case Study of Job-Shop Scheduling
نویسنده
چکیده
منابع مشابه
Train Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem
The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...
متن کاملA New model for integrated lot sizing and scheduling in flexible job shop problem
In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...
متن کاملConstraint-directed search : a case study of job-shop scheduling
This thesis investigates the problem of constraint-directed reasoning in the job-shop scheduling domain. The job-shop scheduling problem is defined as: selecting a sequence of operations whose execution results in the completion of an order, and assigning times (i.e., start and end times) and resources to each operation. The number of possible schedules grows exponentially with the number of or...
متن کاملJob-Shop Scheduling: An Investigation in Constraint-Directed Reasoning
1. Introduction I___-This paper describes ISIS-II*, a constraint-directed reasoning system for the scheduling of factory job-shops. ISIS-II takes a heuristic search approach to generating schedules. The key features of ISIS-II's approach is that it can represent and use a variety of different types of constraints to guide the search, and is able to selectively relax conflicting constraints.
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1983